PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking
نویسندگان
چکیده
منابع مشابه
Enhancing a search algorithm to perform intelligent backtracking
This paper illustrates how a Prolog program, using chronological backtracking to find a solution in some search space, can be enhanced to perform intelligent backtracking. The enhancement crucially relies on the impurity of Prolog that allows a program to store information when a dead end is reached. To illustrate the technique, a simple search program is enhanced. To appear in Theory and Pract...
متن کاملDomain Filtering can Degrade Intelligent Backtracking Search
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can detect infeasible values and removes them from the domains of variables once and for all. A similar modification is then made to Gaschnig's backjumping routine BJ and to Haralick and Elliott's forward checking routine FC. ...
متن کاملIdol-Guided Backtracking Search Optimization Algorithm
This paper introduces a new variant of the Backtracking Search Optimization Algorithm (BSA) in order to improve the quality of the solutions found by the algorithm. The proposed algorithm is called Idol-Guided Backtracking Search Optimization Algorithm (IG-BSA): it uses the historical population defined in BSA to build and update a set of idols taken from several previous generations, and the c...
متن کاملIntelligent Backtracking in the Echidna Constraint Logic Programming System
Abstract: A new type of reasoning engine for model-based expert system applications is described which employs recent advances in constraint logic programming (CLP), intelligent backtracking (IB) and schema (object-oriented) knowledge representations. Constraint reasoning and logic programming (LP) have been recently joined in the new field of CLP. There is keen research interest and new CLP la...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2004
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068403001893